منابع مشابه
Random graphs from a block-stable class
A class of graphs is called block-stable when a graph is in the class if and only if each of its blocks is. We show that, as for trees, for most n-vertex graphs in such a class, each vertex is in at most (1+o(1)) log n/ log log n blocks, and each path passes through at most 5(n log n) blocks. These results extend to ‘weakly blockstable’ classes of graphs.
متن کاملRandom Graphs from a Block Class
A block class is a class of graphs such that a graph is in the class if and only if each of its blocks is. We show that, as for trees, for most random n-vertex graphs in such a class, each vertex is in at most (1+o(1)) log n/ log logn blocks, and each path passes through at most 5(n log n) blocks. Further, these results remain true when we condition on the numbers of components and blocks, and ...
متن کاملThe Class of Random Graphs Arising from Exchangeable Random Measures
We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a probabilistic symmetry: invariance of the distribution of each graph to an arbitrary relabelings of its vertices. In particular, following Caron and Fox, we interpret ...
متن کاملA Survey on Simulating Stable Random Variables
In general case, Chambers et al. (1976) introduced the following algorithm for simulating any stable random variables $ X/sim(alpha, beta, gamma, delta) $ with four parameters. They use a nonlinear transformation of two independent uniform random variables for simulating an stable random variable... (to continue, click here)
متن کاملRandom Graphs from a Weighted Minor-Closed Class
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a more general model. We consider random graphs from a ‘well-behaved’ class of graphs: examples of such classes include all minor-closed classes of graphs with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2016.05.005